Toll convexity

نویسندگان

  • Liliana Alcón
  • Bostjan Bresar
  • Tanja Gologranc
  • Marisa Gutierrez
  • Tadeja Kraner Sumenjak
  • Iztok Peterin
  • Aleksandra Tepeh
چکیده

A walk W between two non-adjacent vertices in a graph G is called tolled if the first vertex of W is among vertices from W adjacent only to the second vertex ofW , and the last vertex ofW is among vertices fromW adjacent only to the second-last vertex of W . In the resulting interval convexity, a set S ⊂ V (G) is toll convex if for any two non-adjacent vertices x, y ∈ S any vertex in a tolled walk between x and y is also in S. The main result of the paper is that a graph is a convex geometry (i.e. satisfies the Minkowski-Krein-Milman property stating that any convex subset is the convex hull of its extreme vertices) with respect to toll convexity if and only if it is an interval graph. Furthermore, some wellknown types of invariants are studied with respect to toll convexity, and toll convex sets in three standard graph products are completely described. ∗Work realized in the frame of MINCYT(Argentina)-ARRS(Slovenia) bilateral projects. †Supported by the Slovenian Ministry of Education, Science and Sport under the grant P1-0297.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Congestion Toll Pricing Models

Recently a methodology for tra c networks has been developed which extracts congestion toll sets such that the tolled user equilibrium is system optimal. Properties of toll sets, such as convexity, are investigated, as well as relationships with other problems. For a given toll set, various objectives can be de ned and optimized with respect to the tolls. Examples include minimizing the total t...

متن کامل

1 Solving Congestion Tollpricing

Recently a methodology for traac networks has been developed which extracts congestion toll sets such that the tolled user equilibrium is system optimal. Properties of toll sets, such as convexity, are investigated, as well as relationships with other problems. For a given toll set, various objectives can be deened and optimized with respect to the tolls. Examples include minimizing the total t...

متن کامل

Calculating Cost Efficiency with Integer Data in the Absence of Convexity

One of the new topics in DEA is the data with integer values. In DEA classic models, it is assumed that input and output variables have real values. However, in many cases, some inputs or outputs can have integer values. Measuring cost efficiency is another method to evaluate the performance and assess the capabilities of a single decision-making unit for manufacturing current products at a min...

متن کامل

CERTAIN SUFFICIENT CONDITIONS FOR CLOSE-TO-CONVEXITY OF ANALYTIC FUNCTIONS

The object of this paper to derive certain sucient condi-tions for close-to-convexity of certain analytic functions dened on theunit disk  

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2015